منابع مشابه
Optimal bounds for Neuman means in terms of geometric, arithmetic and quadratic means
*Correspondence: [email protected] 2School of Mathematics and Computation Science, Hunan City University, Yiyang, 413000, China Full list of author information is available at the end of the article Abstract In this paper, we present sharp bounds for the two Neuman means SHA and SCA derived from the Schwab-Borchardt mean in terms of convex combinations of either the weighted arithmetic and ...
متن کاملIntegrating K-means with Quadratic Programming Feature Selection
Several data mining problems are characterized by data in high dimensions. One of the popular ways to reduce the dimensionality of the data is to perform feature selection, i.e, select a subset of relevant and non-redundant features. Recently, Quadratic Programming Feature Selection (QPFS) has been proposed which formulates the feature selection problem as a quadratic program. It has been shown...
متن کاملApplications of quadratic D-forms to generalized quadratic forms
In this paper, we study generalized quadratic forms over a division algebra with involution of the first kind in characteristic two. For this, we associate to every generalized quadratic from a quadratic form on its underlying vector space. It is shown that this form determines the isotropy behavior and the isometry class of generalized quadratic forms.
متن کاملAnalysing quadratic effects of formative constructs by means of variance-based structural equation modelling
Institute for Management Research, Radboud University Nijmegen, The Netherlands; Higher Institute of Statistics and Knowledge Management (ISEGI), Universidade Nova de Lisboa, Portugal; Faculty of Business Studies and Economics, University of Kaiserslautern, Germany; Faculty of Economic and Business, University of Groningen, The Netherlands; School of Media and Communication, RMIT University, Me...
متن کاملNielson-type transfinite triangular interpolants by means of quadratic energy functional optimizations
We generalize the transfinite triangular interpolant of (Nielson, 1987) in order to generate visually smooth (not necessarily polynomial) local interpolating quasi-optimal triangular spline surfaces. Given as input a triangular mesh stored in a half-edge data structure, at first we produce a local interpolating network of curves by optimizing quadratic energy functionals described along the arc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2003
ISSN: 0022-247X
DOI: 10.1016/j.jmaa.2003.08.014